BELIEF-FREE RATIONALIZABILITY AND INFORMATIONAL ROBUSTNESS By

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight only on profiles of types of other players and states that that type thinks possible, combined with actions of those types that have survived so far. We describe a number of applications. This solution concept characterizes the implications of equilibrium when a player is known to have some private information but may have additional information. It thus answers the "informational robustness" question of what can we say about the set of outcomes that may arise in equilibrium of a Bayesian game if players may observe some additional information. JEL Classification: C72, C79, D82, D83.